Generation of network-on-chip layout based on user specified topological constraints

ABSTRACT

In an aspect, the present disclosure provides a method that comprises automatic generation of a NoC from specified topological information based on projecting NoC elements of the NoC onto a grid layout. In an aspect, the specified topological information, including specification of putting constraints on positions/locations of NoC elements and links thereof, can be input by a user in real space, and can then be projected on the grid layout.

CROSS REFERENCE TO RELATED APPLICATION

The present application is a continuation of U.S. patent application Ser. No. 14/625,132, filed on Feb. 18, 2015, now issued as U.S. Pat. No. 10,050,843 on Aug. 14, 2018, the disclosures of which are incorporated by reference in its entirety for all purposes.

BACKGROUND Technical Field

Methods and example implementations described herein are generally directed to interconnect architecture, and more specifically, to generation of Network-On-Chip (NoC) layout based on user specified topological constraints.

Related Art

The number of components on a chip is rapidly growing due to increasing levels of integration, system complexity, and shrinking transistor geometry. Complex System-on-Chips (SoCs) may involve a variety of components e.g., processor cores, DSPs, hardware accelerators, memory and I/O, while Chip Multi-Processors (CMPs) may involve a large number of homogenous processor cores, memory and I/O subsystems. In both SoC and CMP systems, the on-chip interconnect plays a role in providing high-performance communication between the various components. Due to scalability limitations of traditional buses and crossbar based interconnects, Network-on-Chip (NoC) has emerged as a paradigm to interconnect a large number of components on the chip. NoC is a global shared communication infrastructure made up of several routing nodes interconnected with each other using point-to-point physical links.

Messages are injected by the source and are routed from the source node to the destination over multiple intermediate nodes and physical links. The destination node then ejects the message and provides the message to the destination. For the remainder of this application, the terms ‘components’, ‘blocks’, ‘hosts’ or ‘cores’ will be used interchangeably to refer to the various system components which are interconnected using a NoC. Terms ‘routers’ and ‘nodes’ will also be used interchangeably. Without loss of generalization, the system with multiple interconnected components will itself be referred to as a ‘multi-core system’.

There are several topologies in which the routers can connect to one another to create the system network. Bi-directional rings (as shown in FIG. 1(a)), 2-D (two dimensional) mesh (as shown in FIG. 1(b)) and 2-D Torus (as shown in FIG. 1(c)) are examples of topologies in the related art. Mesh and Torus can also be extended to 2.5-D (two and half dimensional) or 3-D (three dimensional) organizations. FIG. 1(d) shows a 3D mesh NoC, where there are three layers of 3×3 2D mesh NoC shown over each other. The NoC routers have up to two additional ports, one connecting to a router in the higher layer, and another connecting to a router in the lower layer. Router 111 in the middle layer of the example has both ports used, one connecting to the router at the top layer and another connecting to the router at the bottom layer. Routers 110 and 112 are at the bottom and top mesh layers respectively, therefore they have only the upper facing port 113 and the lower facing port 114 respectively connected.

Packets are message transport units for intercommunication between various components. Routing involves identifying a path composed of a set of routers and physical links of the network over which packets are sent from a source to a destination. Components are connected to one or multiple ports of one or multiple routers; with each such port having a unique ID. Packets carry the destination's router and port ID for use by the intermediate routers to route the packet to the destination component.

Examples of routing techniques include deterministic routing, which involves choosing the same path from A to B for every packet. This form of routing is independent from the state of the network and does not load balance across path diversities, which might exist in the underlying network. However, such deterministic routing may implemented in hardware, maintains packet ordering and may be rendered free of network level deadlocks. Shortest path routing may minimize the latency as such routing reduces the number of hops from the source to the destination. For this reason, the shortest path may also be the lowest power path for communication between the two components. Dimension-order routing is a form of deterministic shortest path routing in 2-D, 2.5-D, and 3-D mesh networks. In this routing scheme, messages are routed along each coordinates in a particular sequence until the message reaches the final destination. For example in a 3-D mesh network, one may first route along the X dimension until it reaches a router whose X-coordinate is equal to the X-coordinate of the destination router. Next, the message takes a turn and is routed in along Y dimension and finally takes another turn and moves along the Z dimension until the message reaches the final destination router. Dimension ordered routing may be minimal turn and shortest path routing.

FIG. 2(a) pictorially illustrates an example of XY routing in a two dimensional mesh. More specifically, FIG. 2(a) illustrates XY routing from node ‘34’ to node ‘00’. In the example of FIG. 2(a), each component is connected to only one port of one router. A packet is first routed over the x-axis till the packet reaches node ‘04’ where the x-coordinate of the node is the same as the x-coordinate of the destination node. The packet is next routed over the y-axis until the packet reaches the destination node.

In heterogeneous mesh topology in which one or more routers or one or more links are absent, dimension order routing may not be feasible between certain source and destination nodes, and alternative paths may have to be taken. The alternative paths may not be shortest or minimum turn.

Source routing and routing using tables are other routing options used in NoC. Adaptive routing can dynamically change the path taken between two points on the network based on the state of the network. This form of routing may be complex to analyze and implement.

A NoC interconnect may contain multiple physical networks. Over each physical network, there may exist multiple virtual networks, wherein different message types are transmitted over different virtual networks. In this case, at each physical link or channel, there are multiple virtual channels; each virtual channel may have dedicated buffers at both end points. In any given clock cycle, only one virtual channel can transmit data on the physical channel.

NoC interconnects may employ wormhole routing, wherein, a large message or packet is broken into small pieces known as flits (also referred to as flow control digits). The first flit is the header flit, which holds information about this packet's route and key message level info along with payload data and sets up the routing behavior for all subsequent flits associated with the message. Optionally, one or more body flits follows the head flit, containing the remaining payload of data. The final flit is the tail flit, which in addition to containing the last payload also performs some bookkeeping to close the connection for the message. In wormhole flow control, virtual channels are often implemented.

The physical channels are time sliced into a number of independent logical channels called virtual channels (VCs). VCs provide multiple independent paths to route packets, however they are time-multiplexed on the physical channels. A virtual channel holds the state needed to coordinate the handling of the flits of a packet over a channel. At a minimum, this state identifies the output channel of the current node for the next hop of the route and the state of the virtual channel (idle, waiting for resources, or active). The virtual channel may also include pointers to the flits of the packet that are buffered on the current node and the number of flit buffers available on the next node.

The term “wormhole” plays on the way messages are transmitted over the channels: the output port at the next router can be so short that received data can be translated in the head flit before the full message arrives. This allows the router to quickly set up the route upon arrival of the head flit and then opt out from the rest of the conversation. Since a message is transmitted flit by flit, the message may occupy several flit buffers along its path at different routers, creating a worm-like image.

Based upon the traffic between various end points, and the routes and physical networks that are used for various messages, different physical channels of the NoC interconnect may experience different levels of load and congestion. The capacity of various physical channels of a NoC interconnect is determined by the width of the channel (number of physical wires) and the clock frequency at which it is operating. Various channels of the NoC may operate at different clock frequencies, and various channels may have different widths based on the bandwidth requirement at the channel. The bandwidth requirement at a channel is determined by the flows that traverse over the channel and their bandwidth values. Flows traversing over various NoC channels are affected by the routes taken by various flows. In a mesh or Torus NoC, there may exist multiple route paths of equal length or number of hops between any pair of source and destination nodes. For example, in FIG. 2(b), in addition to the standard XY route between nodes 34 and 00, there are additional routes available, such as YX route 203 or a multi-turn route 202 that makes more than one turn from source to destination.

In a NoC with statically allocated routes for various traffic flows, the load at various channels may be controlled by intelligently selecting the routes for various flows. When a large number of traffic flows and substantial path diversity is present, routes can be chosen such that the load on all NoC channels is balanced nearly uniformly, thus avoiding a single point of bottleneck. Once routed, the NoC channel widths can be determined based on the bandwidth demands of flows on the channels. Unfortunately, channel widths cannot be arbitrarily large due to physical hardware design restrictions, such as timing or wiring congestion. There may be a limit on the maximum channel width, thereby putting a limit on the maximum bandwidth of any single NoC channel.

Additionally, wider physical channels may not help in achieving higher bandwidth if messages are short. For example, if a packet is a single flit packet with a 64-bit width, no matter how wide a channel is, the channel will only be able to carry 64 bits per cycle of data if all packets over the channel are similar. Thus, a channel width is also limited by the message size in the NoC. Due to these limitations on the maximum NoC channel width, a channel may not have enough bandwidth in spite of balancing the routes.

To address the above bandwidth concern, multiple parallel physical NoCs may be used. Each NoC may be called a layer, thus creating a multi-layer NoC architecture. Hosts inject a message on a NoC layer which is then routed to the destination on the same NoC layer, where it is delivered from the NoC layer to the host. Thus, each layer operates more or less independently from each other, and interactions between layers may only occur during the injection and ejection times. FIG. 3(a) illustrates a two layer NoC. Here the two NoC layers are shown adjacent to each other on the left and right, with the hosts connected to the NoC replicated in both left and right diagrams. A host is connected to two routers of different layers, wherein, for instance a router connected to host in the first layer is shown as R1, and a router connected to the same host in the second layer is shown as R2. In this example, the multi-layer NoC is different from the 3D NoC. In this case multiple layers are on a single silicon die and are used to meet the high bandwidth demands of the communication between hosts on the same silicon die. Messages do not go from one layer to another. For purposes of clarity, the present application will utilize such a horizontal left and right illustration for multi-layer NoC to differentiate from the 3D NoCs, which are illustrated by drawing the NoCs vertically over each other.

In FIG. 3(b), a host connected to a router from each layer, R1 and R2 respectively, is illustrated. Each router is connected to other routers in its layer using directional ports 301, and is connected to the host using injection and ejection ports 302. A bridge-logic 303 may sit between the host and the two NoC layers to determine the NoC layer for an outgoing message and sends the message from host to the NoC layer, and also perform the arbitration and multiplexing between incoming messages from the two NoC layers and delivers them to the host.

In a multi-layer NoC, the number of layers needed may depend upon a number of factors such as the aggregate bandwidth requirement of all traffic flows in the system, the routes that are used by various flows, message size distribution, maximum channel width, etc. Once the number of NoC layers in NoC interconnect is determined in a design, different messages and traffic flows may be routed over different NoC layers. Additionally, one may design NoC interconnects such that different layers have different topologies in number of routers, channels and connectivity. The channels in different layers may have different widths based on the flows that traverse over the channel and their bandwidth requirements. With such a large variety of design choices, determining the right combination of routers, channels, and interconnections for a given system remains a challenge and time consuming manual process, often resulting in sub-optimal and inefficient designs.

System on Chips (SoCs) are becoming increasingly sophisticated, feature rich, and high performance by integrating a growing number of standard processor cores, memory & I/O subsystems, and specialized acceleration IPs. To address this complexity, the Network-on-Chip (NoC) approach of connecting SoC components is gaining popularity. A NoC can provide connectivity to a plethora of components and interfaces and simultaneously enable rapid design closure by being automatically generated from a high level specification. The specification describes the interconnect requirements of the SoC in terms of connectivity, bandwidth and latency. In addition to this, information such as position of various components, protocol information, clocking and power domains, etc. may be supplied. A NoC compiler can then use this specification to automatically design a NoC for the SoC. A number of NoC compilers were introduced in the related art that automatically synthesize a NoC to fit a traffic specification. In such design flows, the synthesized NoC is simulated to evaluate the performance under various operating conditions and to determine whether the specifications are met. This may be necessary because NoC-style interconnects are distributed systems and their dynamic performance characteristics under load are difficult to predict statically and can be very sensitive to a wide variety of parameters.

In order to obtain an efficient and resource-sensitive NoC architecture, it is therefore important and desired to generate an optimal NoC layout based on user specified topological constraints.

SUMMARY

The present disclosure is directed to an architecture that enables generation of an optimal NoC layout based on user specified topological constraints. In an aspect, the NoC layout is defined such that the number of turns, while routing between two or more NoC elements such as routers and bridges, is minimal across the complete system.

In an aspect, the present disclosure provides a method that comprises automatic generation of a NoC from specified topological information based on projecting NoC elements of the NoC onto a grid layout. In an instance, although the present disclosure is being explained with reference to the NoC elements being routers and/or bridges, any other appropriate NoC element is completely within the scope of the present disclosure. In an aspect, the specified topological information, including specification of putting constraints on positions/locations of NoC elements and links thereof, can be input by a user in real space, and can then be projected on the grid layout.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting a plurality of nodes, a plurality of routers, and a plurality of links onto the grid layout based on the specified topological information, wherein the projected plurality of routers, the plurality of nodes, and the plurality of links can initially be disabled, and then selectively enabled for at least one of the plurality of routers, the plurality of nodes, and the plurality of links on the grid layout based on one or more constraints for one or more layers of the NoC. In another aspect, NoC agents can be provided on the enabled plurality of nodes of the grid layout. In another aspect, traffic can be provided between the enabled NoC agents, and mapping can be performed for the traffic to the enabled routers and the enabled links of the NoC.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting a plurality of routers, a plurality of nodes, and a plurality of links onto the grid layout based on the specified topological information, wherein the projected plurality of routers, the plurality of nodes, and the plurality of links can be initially enabled, and then selectively disabled for at least one of the plurality of routers, the plurality of nodes, and the plurality of links on the grid layout based on one or more constraints for one or more layers of the NoC. In another aspect, NoC agents can be provided on the enabled plurality of nodes of the grid layout. In another aspect, traffic can be provided between the enabled NoC agents, and mapping can be performed for the traffic to the enabled routers and the enabled links of the NoC.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting a plurality of routers, a plurality of links, and a plurality of NoC agents onto a heterogeneous grid layout based on one or more constraints for one or more layers of the NoC and the specified topological information, wherein grid sizes of the heterogeneous grid layout can be derived from the specified topological information. In an aspect, once configured on the grid layout, traffic can be provided between the plurality of NoC agents to enable mapping of the traffic to the NoC.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting onto an auto-determined grid, a plurality of routers, a plurality of links, and a plurality of NoC agents based on the specified topological information, such that once projected, traffic can be provided between the plurality of NoC agents and traffic to the NoC can be mapped.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting a plurality of agents, a plurality of routers, and a plurality of links onto a grid layout from the specified topological information, and transforming the plurality of links, the plurality of routers, and the plurality of agents on the grid layout to another grid layout through a space transformation algorithm, wherein the space transformation algorithm can be configured to address one or more constraints of one or more layers of the NoC. In another aspect, traffic can be provided between the transformed plurality of agents, and the traffic provided to the NoC can be mapped.

In an example embodiment, disclosure of the present disclosure relates to a non-transitory computer readable medium, storing instructions for executing a process, the instructions comprising automatic generation of NoC from specified topological information based on projecting NoC elements to a grid layout.

The foregoing and other objects, features and advantages of the example implementations will be apparent and the following more particular descriptions of example implementations as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1(a), 1(b) 1(c) and 1(d) illustrate examples of Bidirectional ring, 2D Mesh, 2D Torus, and 3D Mesh NoC Topologies.

FIG. 2(a) illustrates an example of XY routing in a related art two dimensional mesh.

FIG. 2(b) illustrates three different routes between a source and destination nodes.

FIG. 3(a) illustrates an example of a related art two layer NoC interconnect.

FIG. 3(b) illustrates the related art bridge logic between host and multiple NoC layers.

FIG. 4 illustrates an example representation showing automatic generation of NoC from specified topological information/constraints.

FIG. 5 illustrates another example representation showing automatic generation of NoC from specified topological information/constraints.

FIGS. 6(a) to 6(d) illustrate example representations showing automatic generation of NoC from specified topological information/constraints.

FIGS. 7(a) to 7(i) illustrate example representations showing automatic generation of NoC from specified topological information/constraints.

FIG. 8 illustrates another example representation showing automatic generation of NoC from specified topological information/constraints.

FIG. 9 illustrates an example flow diagram showing automatic generation of NoC from specified topological information/constraints.

DETAILED DESCRIPTION

The following detailed description provides further details of the figures and example implementations of the present application. Reference numerals and descriptions of redundant elements between figures are omitted for clarity. Terms used throughout the description are provided as examples and are not intended to be limiting. For example, the use of the term “automatic” may involve fully automatic or semi-automatic implementations involving user or administrator control over certain aspects of the implementation, depending on the desired implementation of one of ordinary skill in the art practicing implementations of the present application.

Aspects of the present disclosure are directed to methods, systems, and non-transitory computer readable mediums for providing an architecture that enables generation of an optimal NoC layout based on user specified topological constraints. In an aspect, the NoC layout is defined such that the number of turns, while routing between two or more NoC elements such as routers and bridges, is minimal across the complete system.

In an aspect, the present disclosure provides a method that comprises automatic generation of a NoC from specified topological information based on projecting NoC elements of the NoC onto a grid layout. In an instance, although the present disclosure is being explained with reference to the NoC elements being routers and/or bridges, any other appropriate NoC element is completely within the scope of the present disclosure. In an aspect, the specified topological information, including specification of putting constraints on positions/locations of NoC elements and links thereof, can be input by a user in real space, and can then be projected on the grid layout.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting a plurality of nodes, a plurality of routers, and a plurality of links onto the grid layout based on the specified topological information, wherein the projected plurality of routers, the plurality of nodes, and the plurality of links can initially be disabled, and then selectively enabled for at least one of the plurality of routers, the plurality of nodes, and the plurality of links on the grid layout based on one or more constraints for one or more layers of the NoC. In another aspect, NoC agents can be provided on the enabled plurality of nodes of the grid layout. In another aspect, traffic can be provided between the enabled NoC agents, and mapping can be performed for the traffic to the enabled routers and the enabled links of the NoC.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting a plurality of routers, a plurality of nodes, and a plurality of links onto the grid layout based on the specified topological information, wherein the projected plurality of routers, the plurality of nodes, and the plurality of links can be initially enabled, and then selectively disabled for at least one of the plurality of routers, the plurality of nodes, and the plurality of links on the grid layout based on one or more constraints for one or more layers of the NoC. In another aspect, NoC agents can be provided on the enabled plurality of nodes of the grid layout. In another aspect, traffic can be provided between the enabled NoC agents, and mapping can be performed for the traffic to the enabled routers and the enabled links of the NoC.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting a plurality of routers, a plurality of links, and a plurality of NoC agents onto a heterogeneous grid layout based on one or more constraints for one or more layers of the NoC and the specified topological information, wherein grid sizes of the heterogeneous grid layout can be derived from the specified topological information. In an aspect, once configured on the grid layout, traffic can be provided between the plurality of NoC agents to enable mapping of the traffic to the NoC.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting onto an auto-determined grid, a plurality of routers, a plurality of links, and a plurality of NoC agents based on the specified topological information, such that once projected, traffic can be provided between the plurality of NoC agents and traffic to the NoC can be mapped.

According to one embodiment, automatic generation of the NoC from the specified topological information can include projecting a plurality of agents, a plurality of routers, and a plurality of links onto a grid layout from the specified topological information, and transforming the plurality of links, the plurality of routers, and the plurality of agents on the grid layout to another grid layout through a space transformation algorithm, wherein the space transformation algorithm can be configured to address one or more constraints of one or more layers of the NoC. In another aspect, traffic can be provided between the transformed plurality of agents, and the traffic provided to the NoC can be mapped.

According to one embodiment, aspects of the present disclosure relate to creation of a constraint grid after applying user specified topological constraints, wherein the topological constraints can be specified by a user, for instance in the real space, by giving a list of bridges and/or routers and/or NoC elements and/or links along with, say their placement/location on a SoC, along with mentioning other constraints desired by the user. Such specified topological constraints can be processed into a grid, which is representative of the NoC layout.

According to one embodiment, using the space transformation algorithm, a virtual NoC layout can be created to enable a simple NoC architecture by incorporating minimal number of turns/resources, and can lead to potential change in the complete virtual grid layout.

According to another example embodiment, NoC layout of the present disclosure can be automatically generated from specified topological constraints based on processing of one or more NoC elements on a standardized grid for layout by projecting the NoC elements onto the grid map. According to one embodiment, the grid layout can be mesh of any size, such as a 6*6 mesh, or any other size for that matter. According to another embodiment, NoC elements can be projected on the grid so as to enable bidirectional reduction.

In an example embodiment, disclosure of the present disclosure relates to automatic generation of NoC from specified topological information based on projecting NoC elements to a grid layout.

FIG. 4 illustrates an example representation 400 showing automatic generation of NoC from specified topological information/constraints based on projecting NoC elements onto a grid layout by projecting a plurality of nodes, a plurality of routers, and a plurality of links onto the grid layout based on the specified topological information, wherein the projected plurality of routers, the plurality of nodes, and the plurality of links are initially disabled, and then selectively enabled for at least one of the plurality of routers, the plurality of nodes, and the plurality of links on the grid layout based on one or more constraints for one or more layers of the NoC. Grid 400 represents a plurality of routers and bridges that are configured on the grid initially, and then link there between are then selectively enabled between specific routers and/or bridges by activation of their links. For instance, although multiple routers and bridges have been configured, links for only links 402 and 404 have been activated. Once enabled, NoC agents can be provided on the enabled ones of the plurality of nodes of the grid layout and traffic can be provided between the provided NoC agents. In another aspect, traffic to the enabled ones of the plurality of routers and the plurality of links of the NoC can also be mapped.

FIG. 5 illustrates an example representation 500 showing automatic generation of NoC from specified topological information/constraints based on projecting NoC elements onto a grid layout by projecting a plurality of nodes, a plurality of routers, and a plurality of links onto the grid layout based on the specified topological information, wherein the projected plurality of routers, the plurality of nodes, and the plurality of links are initially enabled, and then selectively disabled for at least one of the plurality of routers, the plurality of nodes, and the plurality of links on the grid layout based on one or more constraints for one or more layers of the NoC. Grid 502 represents a plurality of routers and bridges that are initially configured on the grid with their links enabled, wherein the links there between can then be selectively disabled between specific routers and/or bridges by deactivation of their links, as is shown in representation 504. For instance, although multiple routers and bridges have been configured, links such as 506 and 508 have been de-activated. Once disabled, NoC agents can be provided on the enabled ones of the plurality of nodes of the grid layout and traffic can be provided between the provided NoC agents. In another aspect, traffic to the enabled ones of the plurality of routers and the plurality of links of the NoC can also be mapped.

FIGS. 6(a) to 6(d) illustrates example representations showing automatic generation of NoC from specified topological information/constraints based on projecting NoC elements onto one or more grid layouts by projecting a plurality of routers, a plurality of links, and a plurality of NoC agents onto a grid layout based on one or more constraints for one or more layers of the NoC and the specified topological information, wherein grid sizes of the heterogeneous grid layout are derived from the specified topological information. As shown, original input layout of NoC agents shown in FIG. 6(a) can be directly transitioned to an equal column width layout as shown in FIG. 6(b), wherein spacing along the X-axis (depicting grid sizes) is same and represents a homogeneous grid layout where the routers and/or the bridges are configured based on their configuration in terms of space, distance, position, and construction in the real space. Once arranged on the homogeneous grid layout, traffic can be provided between the plurality of NoC agents and the traffic can be mapped to the NoC.

FIG. 6(c) shows another grid representation from the original input of FIG. 6(a), wherein the representation of FIG. 6(c) shows a heterogeneous grid layout having different width sizes based on alignment, topological information/constraints, position, location, among other parameters of the NoC agent. As further shown, heterogeneous grid layout of FIG. 6(c) can, in an aspect, further be automatically converted into a grid layout by projecting an auto-determined grid on a plurality of routers, a plurality of links, and a plurality of NoC agents based on the specified topological information, and providing traffic between the plurality of NoC agents and mapping the traffic to the NoC. As can be seen, representation of FIG. 6(d) comprises projection of router/bridge attributes such as location, construction, links, position, space, onto the auto-determined grid that has equal spacing and sizing as regards the X-axis. The present embodiment therefore enables determination of the grid based on business specification based on real coordinate and not the grid coordinates, wherein based on different types of specifications, the proposed system automatically transitions the real space to a constrained grid.

FIGS. 7(a) through 7(i) illustrate example representations showing automatic generation of NoC from specified topological information/constraints based on projecting NoC elements onto a grid layout by providing a plurality of agents, a plurality of routers, and a plurality of links onto a grid layout from the specified topological information, and transforming the plurality of links, the plurality of routers, and the plurality of agents on the grid layout to another grid layout through a space transformation algorithm, wherein the space transformation algorithm can be configured to address one or more constraints of one or more layers of the NoC. The illustrated representations illustrate taking an arbitrary topology that has been drawn by a user and flattening the topology and constraints defined therein into a virtual topology, say wherein there is no need to take any turns. In an aspect, traffic can then be provided between the transformed plurality of agents and the provided traffic can be mapped to the NoC. FIGS. 7(a) and 7(b) two exemplary rules/topologies that can be incorporated while changing/flattening the grid layout, wherein FIG. 7(a) illustrates a U type removal that converts NoC agents configured in U-shape to a flat architecture, and FIG. 7(b) illustrates a L type removal that converts NoC agents configured in L-shape to a flat architecture.

FIG. 7(c) illustrates an original input layout having say 11 routers/NoC agents from R1-R11. FIG. 7(d) illustrates a U-type compression on the original input layout of FIG. 7(c) to give representation 702. FIG. 7(e) takes the representation of 702 to implement another U-type compression and yield 704. FIG. 7(f) takes the representation 704 to implement two more U-type compressions to yield 706, wherein FIG. 7(g) takes the representation 706 to implement two L-type compressions to yield 708. FIG. 7(h) takes the representation 708 to implement another U-type compression to yield 710. FIG. 7(i) takes the representation 710 to implement another U-type compression to yield 712.

FIG. 8 illustrates an example flow diagram 800 in an aspect of the present disclosure. In step 802, an original NoC agent layout can be received and at step 804, it can be checked if a U-type compression can be applied on the layout with an attempt to flatten the grid layout, wherein in case the U-type compression can be applied, the same can be performed at 806 and the method can go back to step 804. In case U-type compression cannot be applied, at step 808, it can be checked as to whether L-type compression can be applied, wherein in case the L-type compression can be applied, the same can be performed at 810 and the method can go back to step 804. In case L-type compression cannot be applied, the final layout can be presented as the final output at step 812.

One should appreciate that the compression mechanisms disclosed herein are completely exemplary in nature and any other technique can be used to create the flattened virtual grid, all of which are completely within the scope of the present disclosure.

FIG. 9 illustrates an example flow diagram 900 in an aspect of the present disclosure. In step 902, topological constraints specified by a user can be received, and at step 904, NoC elements that form part of or are affected by the topological constraints can be projected onto a grid layout by positioning NoC agents, and at step 906, NoC can be generated based on the grid layout and traffic configured to flow through the NoC agents/elements and links there between.

Furthermore, some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations within a computer. These algorithmic descriptions and symbolic representations are the means used by those skilled in the data processing arts to most effectively convey the essence of their innovations to others skilled in the art. An algorithm is a series of defined steps leading to a desired end state or result. In the example implementations, the steps carried out require physical manipulations of tangible quantities for achieving a tangible result.

Moreover, other implementations of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the example implementations disclosed herein. Various aspects and/or components of the described example implementations may be used singly or in any combination. It is intended that the specification and examples be considered as examples, with a true scope and spirit of the application being indicated by the following claims. 

What is claimed is:
 1. A method, comprising: projecting Network on Chip (NoC) elements of a NoC to a grid layout based on specified topological information; and automatically generating the NoC from the projection of the NoC elements to the grid layout; wherein the projecting NoC elements of the NoC to the grid layout based on the specified topological information comprises: projecting a plurality of routers and a plurality of links, and a plurality of NoC agents onto a heterogeneous grid layout based on one or more constraints for one or more layers of the NoC and the specified topological information, wherein grid sizes of the heterogeneous grid layout are derived from the specified topological information; converting the heterogenous grid layout to a grid layout having equal widths through projecting an auto-determined grid on the plurality of routers, the plurality of links, and the plurality of NoC agents according to the specified topological information; providing traffic between the plurality of NoC agents; and mapping the traffic to the NoC.
 2. A non-transitory computer readable medium, storing instructions for executing a process, the instructions comprising: projecting Network on Chip (NoC) elements of a NoC to a grid layout based on specified topological information; and automatically generating the NoC from the projection of the NoC elements to the grid layout; wherein the projecting NoC elements of the NoC to the grid layout based on the specified topological information comprises: projecting a plurality of routers and a plurality of links, and a plurality of NoC agents onto a heterogeneous grid layout based on one or more constraints for one or more layers of the NoC and the specified topological information, wherein grid sizes of the heterogeneous grid layout are derived from the specified topological information; converting the heterogenous grid layout to a grid layout having equal widths through projecting an auto-determined grid on the plurality of routers, the plurality of links, and the plurality of NoC agents according to the specified topological information; providing traffic between the plurality of NoC agents; and mapping the traffic to the NoC. 